Generalization of Vigenere Cipher

نویسنده

  • Yumnam Kirani Singh
چکیده

A generalized way of Vigenere cipher is proposed. Instead of using a Vigenere square for encryption and decryption, any two reversible square matrices whose rows or columns are unique are used for encryption and decryption purpose. One matrix can be easily obtained from the other and hence any one of them can be used for encryption while the other can be derived from the other for decryption. This avoids the necessity of using two separate reversible matrices for encryption and decryption. Also, a new algorithm for generation of key-stream with or without using a random symbol sequence is suggested. The key streams are generated from a small key word. The key streams are different for any slight difference of keywords either in length or content. Moreover, a key stream would be effectively random and could be made as long as we please.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cryptanalysis of Vigenere Cipher using Particle Swarm Optimization with Markov chain random walk

Vigenere cipher is a polyalphabetic substitution cipher with a very large key space. In this paper we have investigated the use of PSO for the cryptanalysis of vigenere cipher and proposed PSO with Markov chain random walk in which some of the worst particles are replaced with new better random particles to enhance the efficiency of PSO algorithm. Based on our experimental results, it is shown ...

متن کامل

Three-Pass Protocol Implementation in Vigenere Cipher Classic Cryptography Algorithm with Keystream Generator Modification

Vigenere Cipher is one of the classic cryptographic algorithms and included into symmetric key cryptography algorithm, where to encryption and decryption process use the same key. Vigenere Cipher has the disadvantage that if key length is not equal to the length of the plaintext, then the key will be repeated until equal to the plaintext length, it course allows cryptanalysts to make the proces...

متن کامل

Developing a Strong Cipher

The vigenere is weak because of key periodicity, but the fake one-time pad based on a random number generator removes that periodicity. This fake one-time pad, however, requires seed-based random number generation and it is therefore a mathematical linear sequence, which lends itself to various flaws as well. I propose that the vigenere can be modified from its base implementation, without rely...

متن کامل

Secure text message transmission in a 4G compatible MIMO MCCDMA system with combined implementation of Vigenere Cipher and RSA cryptographic algorithm

In this paper, a comprehensive performance evaluative study has been made on a secured MIMO MCCDMA wireless communication system with implementation of Minimum Mean Square Error (MMSE) and ZeroForcing (ZF) Linear channel equalization schemes. The 4G compatible system deploys two channel encoding schemes(1/2-rated Convolutional and CRC ) under BPSK,DPSK QPSK and QAM digital modulations. In the p...

متن کامل

Applying Genetic Algorithms for Searching Key-Space of Polyalphabetic Substitution Ciphers

In this paper the Cryptanalysis of polyalphabetic by applying Genetic algorithm is presented. The applicability of Genetic algorithms for searching the key space of encryption scheme is studied. In Vigenere cipher, guessing the key size is done by applying Genetic Algorithm. The frequency analysis is used as an essential factor in objective function.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012